Mobile vs. point guards
نویسندگان
چکیده
We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using “rectangular vision”. We prove a sharp bound on the minimum number of point guards required to cover the gallery in terms of the minimum number of vertical mobile guards and the minimum number of horizontal mobile guards required to cover the gallery. Furthermore, we show that the latter two numbers can be calculated in linear time.
منابع مشابه
Art Gallery Theorems and Approximation Algorithms
The art gallery problem is to determine the number of guards that are sufficient to cover or see every point in the interior of an art gallery. An art gallery can be viewed as a polygon P with or without holes with a total of n vertices and guards as points in P . Any point z ∈ P is said to be visible from a guard g if the line segment joining z and g does not intersect the exterior of P . Usua...
متن کاملA Unified Framework for Two-guard Walk Problem
We propose a unified framework to study the walk problem in a polygonal area by two collaborative guards. A walk is conducted by the two mobile guards on the area’s boundary. They start at an initial boundary point, move along the boundary, and may possibly meet together again at an ending boundary point. It is required that the two guards maintain their mutual visibility at all times. Dependin...
متن کاملFast positioning of limited-visibility guards for the inspection of 2D workspaces
This paper presents a novel method for deciding the locations of “guards” required to visually inspect a given 2D workspace. The decided guard positions can then be used as control points in the path of a mobile robot that autonomously inspects a workspace. It is assumed that each of the guards (or the mobile robot that visits the guard positions in some order) is equipped with a panoramic came...
متن کاملA New Lower Bound on Guard Placement for Wireless Localization
The problem of wireless localization asks to place and orient stations in the plane, each of which broadcasts a unique key within a fixed angular range, so that each point in the plane can determine whether it is inside or outside a given polygonal region. The primary goal is to minimize the number of stations. In this paper we establish a lower bound of ⌊2n/3⌋−1 stations for polygons in genera...
متن کاملSome Results on Open-Edge and Open Mobile Guarding of Polygons and Triangulations
This paper focuses on a variation of the Art Gallery problem that considers open edge guards and open mobile guards. A mobile guard can be placed on edges and diagonals of a polygon, and the “open” prefix means that the endpoints of such edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to gua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.02619 شماره
صفحات -
تاریخ انتشار 2017